#include <data_structure_design/linked_list.h>
#include <iostream>

int main()
{
    LinkedList test;
    LinkedListNode l;
    l.data = 34.97;
    l.next = null;
    test.push_front(4.02);
    test.push_back(76.84);
    LinkedListNode *test2 = test.begin();
    LinkedListNode *test3 = test.end();
    double & test4 = test.front();
    double & test5 = test.back();
    LinkedListNode *test6 = test.insert(45.23, l );
    unsigned int test7 = test.size();

    return 0;
}
